Approximate Partial Order Reduction

We develop a partial order reduction method for labeled transition systems over metric spaces. We introduce the notion of ε-independent actions such that executing these actions in any order results in states that are close to each other. Then we define ε-equivalent action sequences that swap ε-independent action pairs. We present an algorithm to over-approximate the reach set of executions that take ε-equivalent action sequences. We are also able to show that the over-approximation can be computed up to arbitrary precision.